A Hybrid Josephy-newton Method for Solving Box Constrained Variational Inequality Problems via the D-gap Function
نویسندگان
چکیده
A box constrained variational inequality problem can be reformulated as an unconstrained minimization problem through the D-gap function. Some basic properties of the aane variational inequality subproblems in the classical Josephy-Newton method are studied. A hybrid Josephy-Newton method is then proposed for minimizing the D-gap function. Under suitable conditions, the algorithm is shown to be globally convergent and locally quadratically convergent. Some numerical results are also presented.
منابع مشابه
A Hybrid Newton Method for Solving Box Constrained Variational Inequality Problems via the D-gap Function
A box constrained variational inequality problem can be reformulated as an unconstrained minimization problem through the D-gap function. A hybrid Newton-type method is proposed for minimizing the D-gap function. Under suitable conditions, the algorithm is shown to be globally convergent and locally quadratically convergent. Some numerical results are also presented.
متن کاملSolving box constrained variational inequalities by using the natural residual with D-gap function globalization
We present a new method for the solution of the box constrained variational inequality problem, BVIP for short. Basically, this method is a nonsmooth Newton method applied to a reformulation of BVIP as a system of nonsmooth equations involving the natural residual. The method is globalized by using the D-gap function. We show that the proposed algorithm is globally and fast locally convergent. ...
متن کاملA hybrid Newton method for solving the variational inequality problem via the D-gap function
The variational inequality problem (VIP) can be reformulated as an unconstrained minimization problem through the D-gap function. It is proved that the D-gap function has bounded level sets for the strongly monotone VIP. A hybrid Newton-type method is proposed for minimizing the D-gap function. Under some conditions, it is shown that the algorithm is globally convergent and locally quadraticall...
متن کاملInexact Josephy–Newton framework for variational problems and its applications to optimization
We propose and analyze a perturbed version of the classical Josephy-Newton method for solving generalized equations, and of the sequential quadratic programming method for optimization problems. This perturbed framework is convenient to treat in a unified way standard sequential quadratic programming, its stabilzed version [9, 2], sequential quadratically constrained quadratic programming [1, 4...
متن کاملGlobal and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
The smoothing Newton method for solving a system of nonsmooth equations F (x) = 0, which may arise from the nonlinear complementarity problem, the variational inequality problem or other problems, can be regarded as a variant of the smoothing method. At the kth step, the nonsmooth function F is approximated by a smooth function f(·, εk), and the derivative of f(·, εk) at xk is used as the Newto...
متن کامل